Selective sampling-based training schemes for core vector machines
نویسندگان
چکیده
منابع مشابه
Training Invariant Support Vector Machines using Selective Sampling
author?) [3] describe the efficient online LASVM algorithm using selective sampling. On the other hand, (author?) [24] propose a strategy for handling invariance in SVMs, also using selective sampling. This paper combines the two approaches to build a very large SVM. We present state-of-the-art results obtained on a handwritten digit recognition problem with 8 millions points on a single proces...
متن کاملA Random Sampling Technique for Training Support Vector Machines
Random sampling techniques have been developed for combinatorial optimization problems. In this note, we report an application of one of these techniques for training support vector machines (more precisely, primal-form maximal-margin classifiers) that solve two-group classification problems by using hyperplane classifiers. Through this research, we are aiming (I) to design efficient and theore...
متن کاملVery Large SVM Training using Core Vector Machines
Standard SVM training has O(m) time and O(m) space complexities, where m is the training set size. In this paper, we scale up kernel methods by exploiting the “approximateness” in practical SVM implementations. We formulate many kernel methods as equivalent minimum enclosing ball problems in computational geometry, and then obtain provably approximately optimal solutions efficiently with the us...
متن کاملQuantum optimization for training support vector machines
Refined concepts, such as Rademacher estimates of model complexity and nonlinear criteria for weighting empirical classification errors, represent recent and promising approaches to characterize the generalization ability of Support Vector Machines (SVMs). The advantages of those techniques lie in both improving the SVM representation ability and yielding tighter generalization bounds. On the o...
متن کاملTraining Data Selection for Support Vector Machines
In recent years, support vector machines (SVMs) have become a popular tool for pattern recognition and machine learning. Training a SVM involves solving a constrained quadratic programming problem, which requires large memory and enormous amounts of training time for large-scale problems. In contrast, the SVM decision function is fully determined by a small subset of the training data, called s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Granular Computing, Rough Sets and Intelligent Systems
سال: 2013
ISSN: 1757-2703,1757-2711
DOI: 10.1504/ijgcrsis.2013.054123